#include<bits/stdc++.h>
using namespace std;
 
int n,l=0;
int t[100050];
 
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&t[i]);
	sort(t+1,t+n+1);
	for(int i=2;i<=n;i++){
		if(t[i]>t[l+1]) l++;
	}
	printf("%d",n-l);
	return 0;
}
